Consistency and Constrained Optimisation for Conditional Preferences
نویسنده
چکیده
TCP-nets are an extension of CP-nets which allow the expression of conditional relative importance of pairs of variables. In this paper it is shown that a simple logic of conditional preferences can be used to express TCP-net orders, as well as being able to represent much stronger statements of importance than TCP-nets allow. The paper derives various sufficient conditions for a subset of the logical language to be consistent, and develops methods for finding a total order on outcomes which is consistent with the set of conditional preferences. This leads also to an approach to the problem of constrained optimisation.
منابع مشابه
Computational techniques for a simple theory of conditional preferences
A simple logic of conditional preferences is defined, with a language that allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets and TCPnets can be mapped into this logic, and the semantics and proof theory generalise those of CP-nets and TCP-nets. The system can also express preferences of a lexicographic kind. The pape...
متن کاملExtending CP-Nets with Stronger Conditional Preference Statements
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets can be expressed in this language, and the semantics and proof theory generalise those of CP-nets. Despite being substantially more expressive, the formalism maintains important properties of CP-nets...
متن کاملUnambiguous Events and Dynamic Choquet Preferences
This paper explores the relationship between dynamic consistency and the existing notions of unambiguous events for Choquet expected utility preferences. A decision maker is faced with an information structure represented by a filtration. We show that the decision maker’s preferences respect dynamic consistency on a fixed filtration if and only if the last stage of the filtration is composed of...
متن کاملReasoning about soft constraints and conditional preferences: complexity results and approximation techniques
Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all three kinds of information. We therefore propose a framework, based on both CP-nets and soft constraints, that handles both hard and soft constraints as well as conditional preferences efficiently and uniformly. We stud...
متن کاملAn Efficient Upper Approximation for Conditional Preference
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative conditional preferences such as CP-nets and conditional preference theories (CPtheories). It is therefore natural to consider approximations of preference, and upper approximations are of particular interest, since they c...
متن کامل